Self-reproduction in cellular automata

Self-Reproduction in Asynchronous Cellular Automata

Building on the work of Von Neumann, Burks, Codd, and Langton, among others, we introduce the first examples of asynchronous self-reproduction in cellular automata. Reliance on a global synchronous update signal has been a limitation of all solutions since the problem of achieving self-production in cellular automata was first attacked by Von Neumann half a century ago. Our results obviate the ...

Self-Reproduction of Worms in Asynchronous Cellular Automata

Abstract—This paper proposes a new self-reproductive model for worms in asynchronous cellular automata, in which a variety of worms can be self-reproduced based on the shapeencoding mechanism. By dealing with interplays among worms properly, they can self-reproduce in parallel. Furthermore, self-reproduction of a worm accompanies leaving the shape information, which avoids the overcrowding of w...

Logical Universality and Self-Reproduction in Reversible Cellular Automata

A reversible cellular automaton (RCA) is a \backward de-terministic" CA in which every connguration of the cellular space has at most one predecessor. Such reversible systems have a close connection to physical reversibility, and have been known to play an important role in the problem of inevitable power dissipation in computing systems. In this paper, we investigate problems of logical univer...

Self-replicating Cellular Automata

Abstract In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are performed by storing a dedicated program (sequence of states) on self-replicating loops, and letting the loops retrieve the operands, exchange data among themselves, and perform the calculations according to a se...

Simulation of Self-Reproduction Phenomenon of Cells in Two-Dimensional Cellular Automata